Some geodesic problems in groups
نویسندگان
چکیده
منابع مشابه
Some geodesic problems in groups
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [8] are polynomial-time reducible to each other. We study two new geodesic problems which arise in a previous paper of the authors and Fusy [5].
متن کاملThe Word and Geodesic Problems in Free Solvable Groups
We study the computational complexity of the Word Problem (WP) in free solvable groups Sr,d, where r ≥ 2 is the rank and d ≥ 2 is the solvability class of the group. It is known that the Magnus embedding of Sr,d into matrices provides a polynomial time decision algorithm for WP in a fixed group Sr,d. Unfortunately, the degree of the polynomial grows together with d, so the uniform algorithm is ...
متن کاملSome counting problems related to permutation groups
1 'I count a lot of things that there's no need to count,' Cameron said. 'Just because that's the way I am. But I count all the things that need to be counted.' A relational structure M consists of a set X and a family of relations on X. The age of M is the class of finite relational structures (in the same language) embeddable in M.
متن کاملGeodesic Problems for Mobile Robots
As mobile robots operate with limited resources which they carry onboard in large obstructed environments, their success is dependent on how efficiently they move while they avoid collision with obstacles and other robots. Moving optimally is the ultimate efficiency a mobile robot can achieve. Therefore, planning optimal motions and devising optimal coordination strategies are two important and...
متن کاملOn some computational problems in finite abelian groups
We present new algorithms for computing orders of elements, discrete logarithms, and structures of finite abelian groups. We estimate the computational complexity and storage requirements, and we explicitly determine the O-constants and Ω-constants. We implemented the algorithms for class groups of imaginary quadratic orders and present a selection of our experimental results. Our algorithms ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups – Complexity – Cryptology
سال: 2010
ISSN: 1867-1144,1869-6104
DOI: 10.1515/gcc.2010.014